منابع مشابه
Coloring Geometric Range Spaces
We study several coloring problems for geometric range-spaces. In addition to their theoretical interest, some of these problems arise in sensor networks. Given a set of points in R or R, we want to color them such that every region of a certain family (e.g., every disk containing at least a certain number of points) contains points of many (say, k) different colors. In this paper, we think of ...
متن کاملProper Coloring of Geometric Hypergraphs
We study whether for a given planar family F there is an m such that any finite set of points can be 3-colored such that any member of F that contains at least m points contains two points with different colors. We conjecture that if F is a family of pseudo-disks, then m = 3 is sufficient. We prove that when F is the family of all homothetic copies of a given convex polygon, then such an m exis...
متن کاملOnline conflict-free coloring for geometric hypergraphs
(i) We provide a framework for online conflict-free coloring (CF-coloring) any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring any k-degenerate hypergraph. Our algorithm uses O(k log n) colors with high probability and this bound is asymptotically optimal for any constant k. Moreover, our algorithm uses O(k log k log n) random bits with high ...
متن کاملPrediction of kordan river geometric changes in the meandering Range
Predictions of total and even partial changes in rivers patterns are as the most essential issues related to rivers geomorphology. In this regarding, a lot of researches have been done by geomorphologists. This research has explored Kordan River aqueduct morphology changes in bights areas of Afkaneh cone surface. Kordan river is the one which has been affected by various factors and has changed...
متن کاملA Range-Compaction Heuristic for Graph Coloring
This paper presents a novel heuristic for graph coloring that works on a range of colors and iteratively tries to make this range more compact. This range-compaction heuristic also has a \pressure" component and an annealing schedule for it. The value of this component is empirically quanti ed. This algorithm is evaluated on a wide range of DIMACS benchmark graphs, and found to be competitive w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2008
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-008-9116-4